- complete permutation
- мат.полная подстановка
English-Russian scientific dictionary. 2008.
complete permutation
Смотреть что такое "complete permutation" в других словарях:
permutation — [pʉr΄myo͞o tā′shən] n. [ME permutacion < MFr < L permutatio < permutare: see PERMUTE] 1. any radical alteration; total transformation 2. a) a complete rearrangement, esp. by interchanging b) Math. any of the total number of groupings, or … English World dictionary
Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… … Wikipedia
Permutation City — infobox Book | name = Permutation City title orig = translator = image caption = Cover of first edition (hardcover) author = Greg Egan illustrator = cover artist = country = Australia language = English series = genre = Science fiction novel… … Wikipedia
Permutation group — In mathematics, a permutation group is a group G whose elements are permutations of a given set M , and whose group operation is the composition of permutations in G (which are thought of as bijective functions from the set M to itself); the… … Wikipedia
Chiffrement par permutation — Chiffrement par transposition Un chiffrement par transposition (ou chiffrement par permutation) est un chiffre qui consiste à changer l ordre des lettres, donc à construire des anagrammes. Cette méthode est connue depuis l Antiquité, puisque les… … Wikipédia en Français
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Symmetric group — Not to be confused with Symmetry group. A Cayley graph of the symmetric group S4 … Wikipedia
GROUPES (mathématiques) - Groupes finis — Née de l’étude des groupes de permutations des racines d’équations, la théorie des groupes finis s’est développée indépendamment depuis le Traité des substitutions et des équations algébriques (1870) de Camille Jordan. Après les travaux… … Encyclopédie Universelle
algebra — /al jeuh breuh/, n. 1. the branch of mathematics that deals with general statements of relations, utilizing letters and other symbols to represent specific sets of numbers, values, vectors, etc., in the description of such relations. 2. any of… … Universalium
Symmetric polynomial — This article is about individual symmetric polynomials. For the ring of symmetric polynomials, see ring of symmetric functions. In mathematics, a symmetric polynomial is a polynomial P(X1, X2, …, Xn) in n variables, such that if any of the… … Wikipedia
